Token-Curated Registry with Citation Graph
نویسندگان
چکیده
منابع مشابه
Fitting a graph to vector data Citation
We introduce a measure of how well a combinatorial graph fits a collection of vectors. The optimal graphs under this measure may be computed by solving convex quadratic programs and have many interesting properties. For vectors in d dimensional space, the graphs always have average degree at most 2(d+1), and for vectors in 2 dimensions they are always planar. We compute these graphs for many st...
متن کاملGoogle Citation Graph: Clustering and Visualization
CERTIFICATE This is to certify that the work entitled " Google Citation Graph : Clustering and Visualization " is the bonafide work carried out by Namendra Kumar(01CS1015) under my supervision and guidance for partial fulfilment of the 3 ACKNOWLEDGEMENTS With great pleasure and deep sense of gratitude, I express my indebtedness to Prof. Sudeshna Sarkar for her invaluable guidance and constant e...
متن کاملCitation Graph Based Ranking in Invenio
Invenio is the web-based integrated digital library system developed at CERN. Within this framework, we present four types of ranking models based on the citation graph that complement the simple approach based on citation counts: time-dependent citation counts, a relevancy ranking which extends the PageRank model, a time-dependent ranking which combines the freshness of citations with PageRank...
متن کاملPartitioning CiteSeer’s Citation Graph Revised Version
CiteSeer is a freely available, online citation database. In this paper, we explore the citation graph of CiteSeer. First, we characterize that graph as given by CiteSeer. Second, considering a set of anchor papers, we give heuristics to find a partition of the graph whose cut is minimal. Finally, we evaluate our solution using different metrics.
متن کاملMetasearch Via the Co-Citation Graph
In spite of numerous search engines available on the web, no single engine is capable of performing “better” under all circumstances. This being the case, metasearch engines have appeared. One major issue in metasearch engine design is the merging problem: given the ranked lists of pages returned by multiple search engines in response to a given query, what is the best way to combine these list...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ledger
سال: 2019
ISSN: 2379-5980
DOI: 10.5195/ledger.2019.182